binary chain

dvejetainė seka statusas T sritis automatika atitikmenys: angl. binary chain; binary sequence; bit chain vok. Binärzeichenfolge, f; Bitfolge, f rus. двоичная последовательность, f; последовательность двоичных знаков, f pranc. séquence binaire, f; suite binaire, f

Automatikos terminų žodynas. – Vilnius: Technika. . 2004.

Look at other dictionaries:

  • binary sequence — dvejetainė seka statusas T sritis automatika atitikmenys: angl. binary chain; binary sequence; bit chain vok. Binärzeichenfolge, f; Bitfolge, f rus. двоичная последовательность, f; последовательность двоичных знаков, f pranc. séquence binaire, f; …   Automatikos terminų žodynas

  • Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… …   Wikipedia

  • Binary star — For the hip hop group, see Binary Star (band). Hubble image of the …   Wikipedia

  • Binary relation — Relation (mathematics) redirects here. For a more general notion of relation, see Finitary relation. For a more combinatorial viewpoint, see Theory of relations. In mathematics, a binary relation on a set A is a collection of ordered pairs of… …   Wikipedia

  • binary fission — Biol. fission into two organisms approximately equal in size. Cf. multiple fission. [1895 1900] * * * ▪ cell division       asexual reproduction by a separation of the body into two new bodies. In the process of binary fission, an organism… …   Universalium

  • bit chain — dvejetainė seka statusas T sritis automatika atitikmenys: angl. binary chain; binary sequence; bit chain vok. Binärzeichenfolge, f; Bitfolge, f rus. двоичная последовательность, f; последовательность двоичных знаков, f pranc. séquence binaire, f; …   Automatikos terminų žodynas

  • Addition-chain exponentiation — In mathematics and computer science, optimal addition chain exponentiation is a method of exponentiation by positive integer powers that requires a minimal number of multiplications. It works by creating a minimal length addition chain that… …   Wikipedia

  • Cunningham chain — In mathematics, a Cunningham chain is a certain sequence of prime numbers. Cunningham chains are named after mathematician A. J. C. Cunningham. They are also called chains of nearly doubled primes. A Cunningham chain of the first kind of length n …   Wikipedia

  • Compound File Binary Format — (CFBF), also called Compound File or Compound Document[1], is a file format for storing numerous files and streams within a single file on a disk. CFBF is developed by Microsoft and is an implementation of Microsoft COM Structured… …   Wikipedia

  • Nearest-neighbor chain algorithm — In the theory of cluster analysis, the nearest neighbor chain algorithm is a method that can be used to perform several types of agglomerative hierarchical clustering, using an amount of memory that is linear in the number of points to be… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.